Semidefinite programming bounds for the average kissing number
نویسندگان
چکیده
The average kissing number in $${\mathbb{R}^n}$$ is the supremum of degrees contact graphs packings finitely many balls (of any radii) . We provide an upper bound for based on semidefinite programming that improves previous bounds dimensions 3,..., 9. A very simple twice number; 6,..., 9 our new first to improve this bound.
منابع مشابه
High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and Vallentin developed a method to find upper bounds for the kissing number based on semidefinite programming. This paper is a report on high accuracy calculations of these upper bounds for n ≤ 24. The bound for n = 16 implies a ...
متن کاملNew Upper Bounds for Kissing Numbers from Semidefinite Programming
In geometry, the kissing number problem asks for the maximum number τn of unit spheres that can simultaneously touch the unit sphere in n-dimensional Euclidean space without pairwise overlapping. The value of τn is only known for n = 1, 2, 3, 4, 8, 24. While its determination for n = 1, 2 is trivial, it is not the case for other values of n. The case n = 3 was the object of a famous discussion ...
متن کاملBounds for projective codes from semidefinite programming
We apply the semidefinite programming method to derive bounds for projective codes over a finite field.
متن کاملOptimal bounds for correlations via semidefinite programming
Nonlocal boxes (NLBs) are devices that are used to generate correlated bits between two spatially separated parties. If the generated correlation is weak, it can sometimes be distilled into a stronger correlation by repeated applications of the nonlocal box. We initiate here a study of the distillation of correlations for nonlocal boxes that output quantum states rather than classical bits. We ...
متن کاملOn semidefinite programming bounds for graph bandwidth
We propose two new lower bounds on graph bandwidth and cyclic bandwidth based on semidefinite programming (SDP) relaxations of the quadratic assignment problem. We compare the new bounds with two other SDP bounds in [A. Blum, G. Konjevod, R. Ravi, and S. Vempala, Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems, Theoretical Computer Science, 235(1):25-42, 2000]...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2022
ISSN: ['1565-8511', '0021-2172']
DOI: https://doi.org/10.1007/s11856-022-2288-4